Single batch machine scheduling with deliveries

We consider the problem of scheduling a set of n jobs on a single batch machine, where several jobs can be processed simultaneously. Each job j has a processing time p_j and a size s_j. All jobs are available for processing at time 0. The batch machine has a capacity D. Several jobs can be batched together and processed simultaneously, provided that the total size of the jobs in the batch does not exceed D. The processing time of a batch is the largest processing time among all jobs in the batch. There is a single vehicle available for delivery of the finished products to the customer, and the vehicle has capacity K. We assume that K = rD, where and r is an integer. The travel time of the vehicle is T; that is, T is the time from the manufacturer to the customer. Our goal is to find a schedule of the jobs and a delivery plan so that the service span is minimized, where the service span is the time that the last job is delivered to the customer. We show that if the jobs have identical sizes, then we can find a schedule and delivery plan in time such that the service span is minimum. If the jobs have identical processing times, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most 11/9 times the optimal service span. When the jobs have arbitrary processing times and arbitrary sizes, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most twice the optimal service span. We also derive upper bounds of the absolute worst‐case ratios in both cases. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 470–482, 2015     

长短周期记忆网络微调的氧气浓缩器寿命预测模型迁移

针对寿命预测模型迁移问题,提出了一种长短周期记忆网络微调(long short-term memory fine tune, LSTM-fine-tune)的迁移模型,利用理想条件下的试验数据对模型进行训练。在迁移过程中,对部分LSTM网络层进行冻结,利用实际服役环境下的数据对网络其他部分进行修正。为验证模型的泛化能力,采用不同相位与幅值的正弦函数生成数据,通过学习数据获取正弦函数的经验知识,并应用至其他正弦函数的回归,结果表明LSTM-fine-tune模型能够快速拟合,平均均方误差仅为1.033 5,明显低于直接预测误差1.536 8。为通过实际监测数据检验本方法泛化能力,分别获取了试验条件下与实际服役环境下氧气浓缩器的数据,对模型的泛化能力进行验证。结果表明,迁移后训练集预测精度提高了43.0%,测试集预测精度提高了20.2%。     

多媒体教学在高校文学课中的应用

多媒体教学以其题材丰富形象、形式新颖、课堂信息量大、节约课堂时间等优势,确立了在现代教学手段中的主要地位。但现阶段的多媒体教学还存在一些需要改进之处。本文分析了高校文学课多媒体教学的利弊,探讨了多媒体教学应用中出现的问题,并提出了相应的改进对策。     

中亚来华留学生汉语学习动机差异性分析

本文通过对新疆师范大学的中亚来华留学生学习动机进行调查,用差异性检验方法,从性别、学历方面进行数据统计分析,从而发现问题,得出结论,为留学生汉语学习动机问题的研究提供参考。     

基于AdaBoost-SVM算法的某火炮炮闩技术状态评估

针对现役装备技术状态评估多依赖于手工拆卸的现状,提出一种基于AdaBoost-SVM模式识别算法的在线技术状态评估方法。利用人工后坐在线检测设备对炮闩装置技术状态参数进行检测,在对检测数据进行相关性分析特征提取的基础上,引入支持向量机模式识别方法,建立炮闩装置技术状态评估模型。通过将评估模型与Ada-Boost算法相结合,每次迭代都根据测试精度对分类错误的样本点和各分量分类器的权重重新赋值,在下一次迭代中形成新的分量分类器以优化分类结果,最终将各分量分类器依其权重综合完成评估。实例分析结果验证了评估模型的正确性和有效性。     

支持向量机的OTHR多频特征目标分类识别法

针对低信噪比下多频法在天波超视距雷达(Over-The-Horizon Radar,OTHR)目标分类识别中分类精度不高的缺点,充分利用雷达量测的一些先验信息,将基于支持向量机(Support Vector Machine,SVM)的多分类器引入多频法中,提出了一种基于SVM的OTHR多频特征目标分类识别方法。仿真结果表明,利用较少的3个频率点,在信噪比较低的条件下可获得较好的分类识别效果,说明了该方法在OTHR目标分类识别中的有效性和可行性。     

基于小波域字典学习方法的图像双重稀疏表示

提出了一种有效地结构化字典生成算法以及图像双重稀疏表示方法.在Rubinstein等提出的图像双重稀疏表示模型的基础上,引入小波零树结构,将同一空间位置对应的同方向跨尺度小波基函数的线性组合作为新的基函数,并通过K-SVD学习算法得到线性组合系数,由此得到了一种更加切合图像方向特征的结构化字典学习算法.在此基础上提出了相应的图像分解与重构算法.遥感图像M项逼近实验以及压缩仿真实验表明,本文提出的结构化字典比已有的字典具有更好的图像稀疏表示效果.     

ARCS动机模型在初中英语语法教学中的应用

语法学习能在一定程度上保证语言的地道性、流畅性和实用性。但就目前来看,英语学习者学习语法的积极性普遍不高,不少英语学习者抱怨英语语法项目琐碎繁杂、语法学习枯燥无聊。针对此现状,本文尝试将ARCS模型的四类动机策略整合于初中英语语法教学,以期有效激发并维持学习者的语法学习热情,提高语法教学效果。     

Real-time prediction of projectile penetration to laminates by training machine learning models withfinite element solver as the trainer

Studies on ballistic penetration to laminates is complicated, but important for design effective protection of structures. Experimental means of study is expensive and can often be dangerous. Numerical simu-lation has been an excellent supplement, but the computation is time-consuming. Main aim of this thesis was to develop and test an effective tool for real-time prediction of projectile penetrations to laminates by training a neural network and a decision tree regression model. A large number of finite element models were developed;the residual velocities of projectiles fromfinite element simulations were used as the target data and processed to produce sufficient number of training samples. Study focused on steel 4340tpolyurea laminates with various configurations. Four different 3D shapes of the projectiles were modeled and used in the training. The trained neural network and decision tree model was tested using independently generated test samples using finite element models. The predicted projectile velocity values using the trained machine learning models are then compared with thefinite element simulation to verify the effectiveness of the models. Additionally, both models were trained using a published experimental data of projectile impacts to predict residual velocity of projectiles for the unseen samples. Performance of both the models was evaluated and compared. Models trained with Finite element simulation data samples were found capable to give more accurate predication, compared to the models trained with experimental data, becausefinite element modeling can generate much larger training set, and thus finite element solvers can serve as an excellent teacher. This study also showed that neural network model performs better with small experimental dataset compared to decision tree regression model.     

Stochastic scheduling subject to machine breakdowns: The preemptive‐repeat model with discounted reward and other criteria

We consider the problem of scheduling a set of jobs on a single machine subject to random breakdowns. We focus on the preemptive‐repeat model, which addresses the situation where, if a machine breaks down during the processing of a job, the work done on the job prior to the breakdown is lost and the job will have to be started from the beginning again when the machine resumes its work. We allow that (i) the uptimes and downtimes of the machine follow general probability distributions, (ii) the breakdown process of the machine depends upon the job being processed, (iii) the processing times of the jobs are random variables following arbitrary distributions, and (iv) after a breakdown, the processing time of a job may either remain a same but unknown amount, or be resampled according to its probability distribution. We first derive the optimal policy for a class of problems under the criterion to maximize the expected discounted reward earned from completing all jobs. The result is then applied to further obtain the optimal policies for other due date‐related criteria. We also discuss a method to compute the moments and probability distributions of job completion times by using their Laplace transforms, which can convert a general stochastic scheduling problem to its deterministic equivalent. The weighted squared flowtime problem and the maintenance checkup and repair problem are analyzed as applications. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004